Finite-state transducer

Results: 120



#Item
21Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt ICON’2008 Tutorial, Pune, DecemberAbstract. We give a quick presentation of the X-machines of Eilenberg, a generalisa

Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt ICON’2008 Tutorial, Pune, DecemberAbstract. We give a quick presentation of the X-machines of Eilenberg, a generalisa

Add to Reading List

Source URL: pauillac.inria.fr

Language: English - Date: 2008-12-14 19:37:35
22Regular Real Analysis Swarat Chaudhuri Rice University   Sriram Sankaranarayanan

Regular Real Analysis Swarat Chaudhuri Rice University Sriram Sankaranarayanan

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2013-04-26 17:57:31
23Data-Parallel String-Manipulating Programs Margus Veanes Todd Mytkowicz  David Molnar

Data-Parallel String-Manipulating Programs Margus Veanes Todd Mytkowicz David Molnar

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-10-28 21:15:16
24The Logic in Computer Science Column by Yuri Gurevich Microsoft Research One Microsoft Way, Redmond WA 98052, USA

The Logic in Computer Science Column by Yuri Gurevich Microsoft Research One Microsoft Way, Redmond WA 98052, USA

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2011-09-16 13:09:59
25Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-03-20 17:09:13
26Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-03-20 17:09:13
27Complexity and Universality of Iterated Finite Automata

Complexity and Universality of Iterated Finite Automata

Add to Reading List

Source URL: www.complex-systems.com

Language: English - Date: 2012-09-20 14:37:05
28Annotating large lattices with the exact word error Rogier C. van Dalen, Mark J. F. Gales Department of Engineering, University of Cambridge, United Kingdom ,   Abstract

Annotating large lattices with the exact word error Rogier C. van Dalen, Mark J. F. Gales Department of Engineering, University of Cambridge, United Kingdom , Abstract

Add to Reading List

Source URL: mi.eng.cam.ac.uk

Language: English - Date: 2015-04-17 05:58:29
29Spelling Correction using Lucene FSTs FOSDEM 2015 Anna Ohanyan () Christian Ziech ()

Spelling Correction using Lucene FSTs FOSDEM 2015 Anna Ohanyan () Christian Ziech ()

Add to Reading List

Source URL: fosdem.org

Language: English - Date: 2015-02-17 07:52:11
30On the Aggregation Problem for Synthesized Web Services Ting Denga , Wenfei Fanb,c , Leonid Libkinb , Yinghui Wub a State Key Laboratory of Software Development Environment, Beihang University b

On the Aggregation Problem for Synthesized Web Services Ting Denga , Wenfei Fanb,c , Leonid Libkinb , Yinghui Wub a State Key Laboratory of Software Development Environment, Beihang University b

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2013-06-07 12:19:43